منابع مشابه
Primate Social Cognition: Uniquely Primate, Uniquely Social, or Just Unique?
Primates undoubtedly have impressive abilities in perceiving, recognizing, manipulating, and predicting other individuals, but only great apes seem to recognize the cognitive basis of manipulative and cooperative tactics or the concept of self. None of these abilities is unique to primates. We distinguish (1) a package of quantitative advantages in social sophistication, perhaps based on more e...
متن کاملOn Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms
Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملA note on uniquely (nil) clean ring
A ring R is uniquely (nil) clean in case for any $a in R$ there exists a uniquely idempotent $ein R$ such that $a-e$ is invertible (nilpotent). Let $C =(A V W B)$ be the Morita Context ring. We determine conditions under which the rings $A,B$ are uniquely (nil) clean. Moreover we show that the center of a uniquely (nil) clean ring is uniquely (nil) clean.
متن کاملUniquely colorable mixed hypergraphs
A mixed hypergraph consists of two families of edges: the C-edges and D-edges. In a coloring every C-edge has at least two vertices of the same color, while every D-edge has at least two vertices colored differently. The largest and smallest possible numbers of colors in a coloring are termed the upper and lower chromatic number, χ̄ and χ, respectively. A mixed hypergraph is called uniquely colo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Virginia Libraries
سال: 2017
ISSN: 2331-3331
DOI: 10.21061/valib.v62i1.1577